Optimal curvature and gradient-constrained directional cost paths in 3-space
نویسندگان
چکیده
منابع مشابه
Determination of Gradient and Curvature Constrained Optimal Paths
This article provides an analysis of gradient and curvature constraints on path form and length, with particular reference to road, rail and pipeline route selection. Initially we examine the case of a single (global) gradient constraint and a planar surface, with or without boundaries and obstacles. This leads on to a consideration of surface representation using rectangular lattices and proce...
متن کاملOn calculation of optimal paths with constrained curvature: the case of long paths
AbsLract4iven two points in the plane, each with the prescribed direction of motion, the question being asked is to find the shortest smooth path of bounded curvature that joins them. The classical result by Dubins [l] that is commonly used gives a sufficient set of paths which is guaranteed to contain the shortest path; the latter is then found by explicitly calculating every path in the set. ...
متن کاملCost-Constrained Matchings and Disjoint Paths
Let G = (V,E) be a graph, where the edges are weighted with elements from a finite commutative semigroup (S, +), and consider the problem of finding a matching M that covers a given set U of vertices whose cost c(M) (where c(M) is the sum of the weights on the edges of M) satisfies a given constraint, i.e., for a given constraint function Φ mapping S to {0, 1}, Φ(c(M)) = 1. This problem is NP-c...
متن کاملCurvature-Constrained Shortest Paths in a Convex Polygon
Let B be a point robot moving in the plane, whose path is constrained to have curvature at most 1, and let P be a convex polygon with n vertices. We study the collision-free, optimal path-planning problem forB moving between two configurations insideP (a configuration specifies both a location and a direction of travel). We present an O(n2 log n) time algorithm for determining whether a collisi...
متن کاملHazard and Safety Regions for Paths with Constrained Curvature
In this paper the problem of collision analysis for a mobile robot operating in a planar environment with moving objects (obstacles) is addressed. The pattern of motion of the potential obstacles cannot be predicted; only a bound on their maximum velocity is available. Based on this information, at its current position the robot constructs the Hazard Region that corresponds to the path it conte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2014
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-014-0243-6